More Colors in a Rainbow
نویسنده
چکیده
With her sexual configurations theory (SCT), vanAnders (2015) wants to solve a number of problems with the current conceptualization of sexual orientation as defined by the sex of the partner(s) one is attracted toandhabitually indicatedwith theKinsey score varying from completely heterosexual to completely homosexual. I agree with van Anders that the conventional conceptualization of sexual orientation has a number of shortcomings. Indeed,whywould the sex of our desired partners be the prime organizing feature of our sexuality? What is the role of partners’ genderedness or of othermajor person characteristics? ‘‘Biological sex’’ is not as clear-cut a category to justify its monopoly position in sexual orientation theory in thefirst place. Obviously, reliance on (difference or similarity between) discrete binary categories ill-caters for those who do not fit them, such as intersex and trans people.Moreover, Kinsey scores are extremely crude.And they are ill-catering for asexuality and inconsiderate of solo sexual experiences. Besides,‘‘the score’’ assumes stabilitywherewe knowdynamic fluidity exists. And indeed, theempiricaldifferences inscoreson thevariousdomains of sexual orientation (attraction, self-identification, and behavior) add to theconfusionofwhatweareexactly referring towhen talking about‘‘sexual orientation.’’ Because of all these problems, van Anders proposes SCT, aimed to better ‘‘address the complexities of actual people’s sexualities’’and she wants to do so in an inclusive, norm free, andnon-discriminatoryway.SheclaimsSCTsusefulnessforselfknowledgeandsexualminorities’empowerment,aswellasfor neuroendocrinological,social,andhealth-relatedresearchmethodologiesandclinicalpractice. Igladlytaketheopportunitytoshare why I feel shehas comea longway in reaching thosegoalswhile at the same timenot fully fulfillingher ambitiouspromises.First, a short description of the SCT is in order.
منابع مشابه
On rainbow 4-term arithmetic progressions
{sl Let $[n]={1,dots, n}$ be colored in $k$ colors. A rainbow AP$(k)$ in $[n]$ is a $k$ term arithmetic progression whose elements have different colors. Conlon, Jungi'{c} and Radoiv{c}i'{c} cite{conlon} prove that there exists an equinumerous 4-coloring of $[4n]$ which is rainbow AP(4) free, when $n$ is even. Based on their construction, we show that such a coloring of $[4n]$...
متن کاملRainbow of Translation: A semiotic approach to intercultural transfer of colors in children's picture books
Abstract The aim of intercultural translation is to communicate. Communication is acted via verbal as well as visual means. The interaction of verbal and visual means of communication makes a set of complex situations which demand special attention in translation. One context in which the interaction of visual and verbal elements gets vital importance is children’s picture books. Color is an in...
متن کاملRainbow of Translation: A semiotic approach to intercultural transfer of colors in children's picture books
Abstract The aim of intercultural translation is to communicate. Communication is acted via verbal as well as visual means. The interaction of verbal and visual means of communication makes a set of complex situations which demand special attention in translation. One context in which the interaction of visual and verbal elements gets vital importance is children’s picture books. Color is an in...
متن کاملOn Rainbow-k-Connectivity of Random Graphs
A path in an edge-colored graph is called a rainbow path if the edges on it have distinct colors. For k ≥ 1, the rainbow-k-connectivity of a graph G, denoted rck(G), is the minimum number of colors required to color the edges of G in such a way that every two distinct vertices are connected by at least k internally vertex-disjoint rainbow paths. In this paper, we study rainbow-k-connectivity in...
متن کاملRainbow numbers for small stars with one edge added
A subgraph of an edge-colored graph is rainbow if all of its edges have different colors. For a graph H and a positive integer n, the anti-Ramsey number f(n, H) is the maximum number of colors in an edge-coloring of Kn with no rainbow copy of H . The rainbow number rb(n, H) is the minimum number of colors such that any edge-coloring of Kn with rb(n, H) number of colors contains a rainbow copy o...
متن کاملRainbow Domination in Graphs
Assume we have a set of k colors and to each vertex of a graph G we assign an arbitrary subset of these colors. If we require that each vertex to which an empty set is assigned has in its neighborhood all k colors, then this is called the k-rainbow dominating function of a graph G. The corresponding invariant γrk(G), which is the minimum sum of numbers of assigned colors over all vertices of G,...
متن کامل